Angewandte Mathematik Und Informatik Universit at Zu K Oln Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
نویسنده
چکیده
We present eecient (parallel) algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solve some algorithmic problems in graphs. This includes split decomposition. We show that eecient parallel split decomposition induces an eecient parallel parity graph recognition algorithm. This is a consequence of the result of 7] that parity graphs are exactly those graphs that can be split decomposed into cliques and bipartite graphs.
منابع مشابه
Angewandte Mathematik Und Informatik Universit at Zu K Oln Parallel Turbulence Simulation Based on Mpi
متن کامل
Angewandte Mathematik Und Informatik Universit at Zu K Oln Basic Design Ideas for the Branch-and-cut-system Abacus
متن کامل
Angewandte Mathematik Und Informatik Universit at Zu K Oln Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances
متن کامل
Angewandte Mathematik Und Informatik Universit at Zu K Oln Traveling the Boundary of Minkowski Sums Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany
We consider the problem of traveling the contour of the set of all points that are within distance 1 of a connected planar curve arrangement P, forming an embedding of the graph G. We show that if the overall length of P is L, there is a closed roundtrip that visits all points of the contour and has length no longer than 2L + 2. This result carries over in a more general setting: if R is a comp...
متن کامل